1894E - Freedom of Choice - CodeForces Solution

//#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef long double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;

const int N = 2e5 + 10, inf = 0x3f3f3f3f3f3f3f3f, mod = 998244353;

int m;
int l[N], r[N];
vii a(N), c(N);
int sum[N];
set<int> st;
map<int, int> mp;
map<int, int> mpmn;

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T;
    cin >> T;
    while (T--)
    {
        cin >> m;
        for (int i = 1; i <= m; i++)
            a[i].clear(), c[i].clear(), sum[i] = 0;
        st.clear();
        mp.clear();
        mpmn.clear();
        int suml = 0, sumr = 0;
        for (int i = 1; i <= m; i++)
        {
            int n;
            cin >> n >> l[i] >> r[i];
            suml += l[i], sumr += r[i];
            for (int j = 0; j < n; j++)
            {
                int x;
                cin >> x;
                a[i].push_back(x);
            }
            for (int j = 0; j < n; j++)
            {
                int x;
                cin >> x;
                c[i].push_back(x);
                sum[i] += x;
            }
        }
        for (int i = 1; i <= m; i++)
        {
            for (int j = 0; j < a[i].size(); j++)
                if (a[i][j] >= suml && a[i][j] <= sumr)
                {
                    st.insert(a[i][j]);
                    mp[a[i][j]] += max(c[i][j] - (sum[i] - r[i]), 0ll);
                    mpmn[a[i][j]] += max(c[i][j] - (sum[i] - l[i]), 0ll);
                }
        }
        if (st.size() < sumr - suml + 1)
        {
            cout << 0 << endl;
            continue;
        }
        int ans = INT64_MAX;
        for (auto it : st)
            ans = min(ans, max(mp[it] - (sumr - it), mpmn[it]));
        cout << ans << endl;
    }
    return 0;
}